#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

int n;

void eval(int x)
{
    if (x)
        eval((x - 1) / 26), putchar('A' + (x - 1) % 26);
}

inline void solution()
{
    cin >> n;
    while (n--)
    {
        string s;
        cin >> s;
        int x, y;
        if (sscanf(s.c_str(), "R%dC%d", &x, &y) == 2)
        {
            eval(y);
            printf("%d\n", x);
        }
        else
        {
            int p = 0;
            int i = 0;
            while (s[i] >= 'A' && s[i] <= 'Z')
                p = p * 26 + s[i] - 'A' + 1, i++;
            printf("R%sC%d\n", &s[i], p);
        }
    }
}

int main()
{
   // freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}
